type github.com/klauspost/compress/flate.literalNode

20 uses

	github.com/klauspost/compress/flate (current package)
		huffman_code.go#L40: 	freqcache [literalCount + 1]literalNode
		huffman_code.go#L43: type literalNode struct {
		huffman_code.go#L81: func maxNode() literalNode { return literalNode{math.MaxUint16, math.MaxUint16} }
		huffman_code.go#L183: func (h *huffmanEncoder) bitCounts(list []literalNode, maxBits int32) []int32 {
		huffman_code.go#L313: func (h *huffmanEncoder) assignEncodingAndSize(bitCount []int32, list []literalNode) {
		huffman_code.go#L347: 			list[count] = literalNode{uint16(i), f}
		huffman_code.go#L353: 	list[count] = literalNode{}
		huffman_sortByFreq.go#L10: func sortByFreq(data []literalNode) {
		huffman_sortByFreq.go#L15: func quickSortByFreq(data []literalNode, a, b, maxDepth int) {
		huffman_sortByFreq.go#L45: func doPivotByFreq(data []literalNode, lo, hi int) (midlo, midhi int) {
		huffman_sortByFreq.go#L133: func insertionSortByFreq(data []literalNode, a, b int) {
		huffman_sortByFreq.go#L145: func medianOfThreeSortByFreq(data []literalNode, m1, m0, m2 int) {
		huffman_sortByLiteral.go#L10: func sortByLiteral(data []literalNode) {
		huffman_sortByLiteral.go#L15: func quickSort(data []literalNode, a, b, maxDepth int) {
		huffman_sortByLiteral.go#L44: func heapSort(data []literalNode, a, b int) {
		huffman_sortByLiteral.go#L63: func siftDown(data []literalNode, lo, hi, first int) {
		huffman_sortByLiteral.go#L80: func doPivot(data []literalNode, lo, hi int) (midlo, midhi int) {
		huffman_sortByLiteral.go#L168: func insertionSort(data []literalNode, a, b int) {
		huffman_sortByLiteral.go#L187: func medianOfThree(data []literalNode, m1, m0, m2 int) {